An Empirical Study of Extended Guided Local Search on the Quadratic Assignment Problem
نویسندگان
چکیده
In this paper, we show how an Extended Guided Local Search can be applied to the Quadratic Assignment Problem and show the extensions can improve its performance. GLS is a general, penalty-based meta-heuristic, which sits on top of local search algorithms, to help guide them out of local minima. GLS has been shown to be successful in solving a number of practical real life problems, such as the travelling salesman problem, BT’s workforce scheduling problem, the radio link frequency assignment problem, the SAT problem, the weighted MAX-SAT problems, and the vehicle routing problem. We present empirical results of applying several extended versions of Guided Local Search to the Quadratic Assignment Problem, and show that these extensions can improve the range of parameter setting within which Guided Local Search performs well. Finally, we compare the results of running our Extended Guided Local Search with some state of the art algorithms for the QAP.
منابع مشابه
Applying an Extended Guided Local Search to the Quadratic Assignment Problem
In this paper, we show how an extended Guided Local Search (GLS) can be applied to the Quadratic Assignment Problem (QAP). GLS is a general, penalty-based meta-heuristic, which sits on top of local search algorithms, to help guide them out of local minima. We present empirical results of applying several extended versions of GLS to the QAP, and show that these extensions can improve the range o...
متن کاملUsing Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem
Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this stu...
متن کاملOffering a New Algorithm to Improve the Answer-Search Algorithm in Quadratic Assignment Problem
Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs pr...
متن کاملGuided Local Search
Guided Local Search (GLS) is an intelligent search scheme for combinatorial optimization problems. A main feature of the approach is the iterative use of local search. Information is gathered from various sources and exploited to guide local search to promising parts of the search space. The application of the method to the Travelling Salesman Problem and the Quadratic Assignment Problem is exa...
متن کاملEstimation of Distribution Algorithm with 2-opt Local Search for the Quadratic Assignment Problem
This chapter proposes a combination of estimation of distribution algorithm (EDA) and the 2-opt local search algorithm (EDA/LS) for the quadratic assignment problem (QAP). In EDA/LS, a new operator, called guided mutation, is employed for generating new solutions. This operator uses both global statistical information collected from the previous search and the location information of solutions ...
متن کامل